Section: Application Domains

Algorithmic Number Theory

Algorithms developed for cryptanalysis have sometimes applications outside cryptanalysis, especially in algorithmic number theory. This has happened for lattices and elliptic curves, and is not surprising, considering that some of the problems studied by cryptanalysis are very basic (like integer factoring), and therefore ubiquitous. Cryptanalysis motivates the search of truly-efficient algorithms, and experiments are common in public-key cryptanalysis, which allows to really verify improvements.